Information-Theoretically Secure Erasure Codes for Distributed Storage

Hybrid Regenerating Codes for Distributed Storage Systems

Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...

Software-Based Erasure Codes for Scalable Distributed Storage

This paper presents a new class of erasure codes, Lincoln Erasure codes (LEC), applicable to large-scale distributed storage that includes thousands of disks attached to multiple networks. A high-performance software implementation that demonstrates the capability to meet these anticipated requirements is described. A framework for evaluation of candidate codes was developed to support in-depth...

Turbo Codes Can Be Asymptotically Information-Theoretically Secure

This paper shows that a turbo-coded communication system can be made secure with a little bit of complexity cost. The classical permutation ciphers are revisited and analyzed. Firstly, the ideal stream permutation ciphers are shown to be asymptotically information-theoretically secure in the sense that the channel from plaintext to ciphertext has a vanished capacity, while the practical stream ...

Information-Theoretically Secure Key-Insulated Multireceiver Authentication Codes

Information Theoretically Secure Databases

We introduce the notion of a database system that is information theoretically secure in between accesses—a database system with the properties that 1) users can efficiently access their data, and 2) while a user is not accessing their data, the user’s information is information theoretically secure to malicious agents, provided that certain requirements on the maintenance of the database are r...